fundamental truth table - traduction vers russe
Diclib.com
Dictionnaire ChatGPT
Entrez un mot ou une phrase dans n'importe quelle langue 👆
Langue:

Traduction et analyse de mots par intelligence artificielle ChatGPT

Sur cette page, vous pouvez obtenir une analyse détaillée d'un mot ou d'une phrase, réalisée à l'aide de la meilleure technologie d'intelligence artificielle à ce jour:

  • comment le mot est utilisé
  • fréquence d'utilisation
  • il est utilisé plus souvent dans le discours oral ou écrit
  • options de traduction de mots
  • exemples d'utilisation (plusieurs phrases avec traduction)
  • étymologie

fundamental truth table - traduction vers russe

KIND OF TRANSFORMATION USED IN COMPUTABILITY THEORY
Weak truth table reduction; Wtt reduction; Bounded Turing reduction; Truth table reduction; Tt-reduction

fundamental truth table      
основная таблица истинности
truth table         
MATHEMATICAL TABLE USED IN LOGIC
Truth tables; Truth-table; Truth Tables; Truth Table; Truthtable; Logical truth table

['tru:θteib(ə)l]

общая лексика

таблица истинности

таблица, полностью описывающая логическую функцию перечислением всех возможных комбинаций входных значений (сигналов) и соответствующие каждой комбинации значения (сигналы) на выходе

вычислительная техника

таблица состояний

Смотрите также

AND; NAND; NOR; NOT; OR; XOR

truth table         
MATHEMATICAL TABLE USED IN LOGIC
Truth tables; Truth-table; Truth Tables; Truth Table; Truthtable; Logical truth table
[лог.] таблица истинностных значений

Définition

fundamental
I. a.
Essential, primary, indispensable, radical, constitutional, organic, most important, principal.
II. n.
Leading principle, essential part, essential principle.

Wikipédia

Truth-table reduction

In computability theory, a truth-table reduction is a reduction from one set of natural numbers to another. As a "tool", it is weaker than Turing reduction, since not every Turing reduction between sets can be performed by a truth-table reduction, but every truth-table reduction can be performed by a Turing reduction. For the same reason it is said to be a stronger reducibility than Turing reducibility, because it implies Turing reducibility. A weak truth-table reduction is a related type of reduction which is so named because it weakens the constraints placed on a truth-table reduction, and provides a weaker equivalence classification; as such, a "weak truth-table reduction" can actually be more powerful than a truth-table reduction as a "tool", and perform a reduction which is not performable by truth table.

A Turing reduction from a set B to a set A computes the membership of a single element in B by asking questions about the membership of various elements in A during the computation; it may adaptively determine which questions it asks based upon answers to previous questions. In contrast, a truth-table reduction or a weak truth-table reduction must present all of its (finitely many) oracle queries at the same time. In a truth-table reduction, the reduction also gives a boolean function (a truth table) which, when given the answers to the queries, will produce the final answer of the reduction. In a weak truth-table reduction, the reduction uses the oracle answers as a basis for further computation which may depend on the given answers but may not ask further questions of the oracle.

Equivalently, a weak truth-table reduction is a Turing reduction for which the use of the reduction is bounded by a computable function. For this reason, they are sometimes referred to as bounded Turing (bT) reductions rather than as weak truth-table (wtt) reductions.

Traduction de &#39fundamental truth table&#39 en Russe